package cn.com.code.leetcode;

/**
 * 1. 两数之和
 * https://leetcode.cn/problems/two-sum/
 *
 * @author zhengpei
 * @date 2022/6/27
 */
public class LeetCode1 {

  public static void main(String[] args) {
    int[] nums = new int[]{2, 7, 11, 15};
    int target = 9;
    System.out.println(new LeetCode1().twoSum(nums, target));
  }

  public int[] twoSum(int[] nums, int target) {
    for (int i = 0; i < nums.length; i++) {
      for (int j = i + 1; j < nums.length; j++) {
        if (nums[i] + nums[j] == target) {
          return new int[]{i, j};
        }
      }
    }
    return null;
  }
}
